SEMI-ON-LINE PARALLEL MACHINES SCHEDULING UNDER KNOWN TOTAL AND LARGEST PROCESSING TIMES
نویسندگان
چکیده
منابع مشابه
Semi-on-line Parallel Machines Scheduling under Known Total and Largest Processing Times
We consider the semi-on-line parallel machines scheduling problem with the known total and the largest processing times of all jobs. We develop an approximation algorithm for the problem and prove that the competitive ratio of the algorithm is not more than √ 10 3 ≈ 1.8257, regardless of the number of machines.
متن کاملSemi-online scheduling on 2 machines under a grade of service provision with bounded processing times
We study the problem of semi-online scheduling on 2 machines under a grade of service (GoS). GoS means that some jobs have to be processed by some machines to be guaranteed a high quality. The problem is online in the sense that jobs are presented one by one, and each job shall be assigned to a time slot on its arrival. Assume that the processing time pi of every job Ji is bounded by an interva...
متن کاملSemi-on-line multiprocessor scheduling with given total processing time
We are given a set of identical machines and a sequence of jobs, the sum of whose weights is known in advance. The jobs are to be assigned on-line to one of the machines and the objective is to minimize the makespan. An algorithm with performance ratio 1.6 and a lower bound of 1.5 is presented. These results improve on the recent results by Azar and Regev, who proposed an algorithm with perform...
متن کاملBi-criteria Scheduling on Parallel Machines Under Fuzzy Processing Time
Job scheduling is concerned with the optimal allocation of scare resources with objective of optimising one or several criteria. Job scheduling has been a fruitful area of research for many decades in which scheduling resolve both allocation of machines and order of processing. If the jobs are scheduled properly, not only the time is saved but also efficiency of system is increased. The paralle...
متن کاملMulti-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2005
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.48.1